A compiler cost model for speculative parallelization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A compiler cost model for speculative multithreading chip-multiprocessor architectures

Speculative parallelisation (also known as speculative multithreading and thread-level speculation) is a technique that complements automatic compiler parallelisation by allowing code sections that cannot be fully analysed by the compiler to be aggressively executed in parallel. However, while speculative parallelisation can potentially deliver significant speedups, several overheads associated...

متن کامل

JavaSpMT: A Speculative Thread Pipelining Parallelization Model for Java Programs

This paper presents a new approach to improve performance of Java programs by extending the superthreaded speculative execution model [14, 15] to exploit coarsegrained parallelism on a shared-memory multiprocessor system. The parallelization model, called Java Speculative MultiThreading (JavaSpMT), combines control speculation with run-time dependence checking to parallelize a wide variety of l...

متن کامل

Speculative Loop Parallelization

Compiler Design Lab Department of Computer Science

متن کامل

Fastpath Speculative Parallelization

We describe Fastpath, a system for speculative parallelization of sequential programs on conventional multicore processors. Our system distinguishes between the lead thread, which executes at almostnative speed, and speculative threads, which execute somewhat slower. This allows us to achieve nontrivial speedup, even on two-core machines. We present a mathematical model of potential speedup, pa...

متن کامل

Techniques for Speculative Run - Time Parallelization ofLoopsManish

This paper presents a set of new run-time tests for speculative parallelization of loops that defy par-allelization based on static analysis alone. It presents a novel method for speculative array privatization that is not only more eecient than previous methods when the speculation is correct, but also does not require rolling back the computation in case the variable is found not to be privat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Architecture and Code Optimization

سال: 2007

ISSN: 1544-3566,1544-3973

DOI: 10.1145/1250727.1250732